# tell me the wheather of today
class Solution {
    public int rob(int[] nums) {
        int n = nums.length;

        if(n == 1) 
            return nums[0];
        else if (n == 2) 
            return Math.max(nums[0],nums[1]);

        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0],nums[1]);
        
        for(int i = 2; i < n; i++){
            dp[i] = Math.max(dp[i-2] + nums[i], dp[i-1]);
        }

        return dp[n-1];
    }
}
# 获取北京今天的天气